Chipping Away at Censorship Firewalls with User-Generated Content Sam Burnett, Nick Feamster, and Santosh Vempala School of Computer Science, Georgia Tech {sburnett, feamster, vempala}@cc.gatech.edu Abstract

Source URL: www.usenix.org

• Computing
• Internet privacy
• Software
• Technology
• Internet censorship
• Text messaging
• Email
• Internet censorship circumvention
• Freenet
• Deep packet inspection
• Steganography
• SMS

Computing Science Group ABSTRACTION FRAMEWORK FOR MARKOV DECISION PROCESSES AND PCTL VIA GAMES Mark Kattenbelt Michael Huth

Source URL: qav.comlab.ox.ac.uk

• Mathematics
• Temporal logic
• Computation tree logic
• Logic in computer science
• Distribution
• Model theory
• Linear temporal logic
• Indescribable cardinal

Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Formal methods
• Mathematical logic
• School of Computer Science
• University of Manchester
• Mathematics
• Logic in computer science
• Automated theorem proving
• Formal verification
• SPASS
• Andrei Voronkov
• Vampire
• First-order logic

Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata Marta Kwiatkowska1 , Gethin Norman2 , and David Parker3 1 Department of Computer Science, University of Oxford, Oxford, UK

Source URL: qav.comlab.ox.ac.uk

• Dynamic programming
• Markov decision process
• Stochastic control
• Symbol
• Timed automaton
• Probability and statistics
• Probability
• Approximation algorithms
• Computational complexity theory

Building Power Consumption Models from Executable Timed I/O Automata Specifications ∗ Benoît Barbot , Marta Kwiatkowska, Alexandru Mereacre and Nicola Paoletti Department of Computer Science, University of Oxford, UK

Source URL: qav.comlab.ox.ac.uk

See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publicationWhen Winning Is Really Losing: Teaching Awards and Women Political Science Faculty Article in Pol

Source URL: www.saramitchell.org

• Gender studies
• Gender equality
• Human behavior
• Gender
• Behavior
• Sexism
• Gender inequality
• Social inequality
• Professors in the United States
• Gender role
• Sexism in academia
• Gender pay gap in the United States

January 30, 2017 The American Political Science Association (APSA) condemns the Executive Order issued on January 27, 2017, entitled “Protecting the Nation From Foreign Terrorist Entry Into the United States,” and st

Source URL: www.apsanet.org

• American Political Science Association
• Dupont Circle
• APSA

Advances and Challenges of Quantitative Verification and Synthesis for Cyber-Physical Systems Marta Kwiatkowska Department of Computer Science, University of Oxford, UK Abstract—We are witnessing a huge growth of cyber

Source URL: qav.comlab.ox.ac.uk

• Model checkers
• Software engineering
• Formal methods
• Theoretical computer science
• Software quality
• Computing
• PRISM model checker
• Model checking
• Formal verification
• Markov chain
• Stochastic
• Reliability engineering

Ritwika Ghosh phone : (+email : Profile : I am a first year graduate student in Computer Science at the University of Illinois, Urbana-Champaign, interested in formal methods, and appl

Source URL: web.engr.illinois.edu

• Mathematical software
• Application software
• Software
• Theoretical computer science
• Formal methods
• Logic in computer science
• Discrete mathematics
• Verification
• Quantifier elimination
• Formal verification
• Model checking
• Computer science

Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW

Source URL: www.lix.polytechnique.fr

• Mathematics
• Multiplication
• Polynomials
• Algebra
• Multiplication algorithm
• Computer algebra
• ToomCook multiplication
• Karatsuba algorithm
• Degree of a polynomial
• Finite field
• Remainder
• Computational complexity of mathematical operations